THE DERIVATION OF MULTIVARIATE SAMPLING FORMULAE FROM UNIVARIATE FORMULAE BY SYMBOLIC OPERATION

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Derivation of Characteristic Formulae

This paper shows how modal mu-calculus formulae characterizing finite-state processes up to strong or weak bisimulation can be derived directly from the well-known greatest fixpoint characterizations of the bisimulation relations. Our derivation simplifies earlier proofs for the strong bisimulation case and, by virtue of derivation, immediately generalizes to various other bisimulation-like rel...

متن کامل

Sampling formulae arising from random Dirichlet populations

Consider the random Dirichlet partition of the interval into n fragments at temperature θ > 0. Some statistical features of this random discrete distribution are recalled, together with explicit results on the law of its size-biased permutation. Using these, pre-asymptotic versions of the Ewens and Donnelly-Tavaré-Griffiths sampling formulae from finite Dirichlet partitions are computed exactly...

متن کامل

t)-deformations of multivariate hook product formulae

We generalize multivariate hook product formulae for P -partitions. We use Macdonald symmetric functions to prove a (q, t)-deformation of Gansner’s hook product formula for the generating functions of reverse (shifted) plane partitions. For a d-complete poset, we present a conjectural (q, t)-deformation of Peterson–Proctor’s hook product formula.

متن کامل

Generalisation of Induction Formulae based on Proving by Symbolic Execution

Induction is a powerful method that can be used to prove the total correctness of program loops. Unfortunately the induction proving process in an interactive theorem prover is often very cumbersome. In particular it can be difficult to find the right induction formula. We describe a method for generalising induction formulae by analysing a symbolic proof attempt in a semi-interactive first-ord...

متن کامل

A Multivariate Normal Law for Turing’s Formulae

This paper establishes a sufficient condition for Turing’s formulae of various orders to have asymptotic multivariate normality. As an application, a consistent estimator of the tail under a discrete power tail model is also described.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Eugenics

سال: 1940

ISSN: 2050-1420

DOI: 10.1111/j.1469-1809.1940.tb02261.x